A New Symbolic Method for Discernibility Matrix in Rough Set
نویسندگان
چکیده
Generating discernibility matrix consumes huge time and space .To solve this problem, A new Binary Discernibility Matrix (BDM) induced from information table is defined, The concept of Binary Conjunction Matrix(BCM) is then introduced, Finally A novel method for discernibility matrix using Zero-Suppressed BDDs (ZBDD) and Ordered binary decision diagrams (OBDD) is proposed in this paper, experiment is carried to compare the storage space of discernibility matrix with that of ZBDD and OBDD, results show that the new method has better storage performance and improve the attribute reduction for those information systems with more objects and features.
منابع مشابه
Symbolic Representation for Rough Set Attribute Reduction Using Ordered Binary Decision Diagrams
The theory of rough set is the current research focus for knowledge discovery, attribute reduction is one of crucial problem in rough set theory. Most existing attribute reduction algorithms are based on algebra and information representations, discernibility matrix is a common knowledge representation for attribute reduction. As problem solving under different knowledge representations corresp...
متن کاملA Comparative Study on Strategies of Rule Induction for Incomplete Data Based on Rough Set Approach
Rough set based rule induction approaches have been studied intensively during past few years. However, classical rough set model cannot deal with incomplete data sets. There are two main categories dealing with this problem: the preprocessing methods and the extensions of rough set model. This paper focuses on the comparison of three strategies for dealing with incomplete data containing three...
متن کاملData analysis based on discernibility and indiscernibility
Rough set theory models similarities and differences of objects based on the notions of indiscernibility and discernibility. With respect to any subset of attributes, one can define two pairs of dual relations: the strong indiscernibility and weak discernibility relations, and the weak indiscernibility and strong discernibility relations. The similarities of objects are examined by the indiscer...
متن کاملFast Algorithm for Attribute Reduction Based on Rough Set Theory Using Binary Discernibility Matrix
Rough set is a valid mathematical tool that deals with uncertain, vague and incomplete information of decision systems. Attribute reduction is one of the issues in rough set theory, and core attributes are indispensable in the process of attribute reduction. Recently, some researchers proposed the method of binary discernibility matrix to compute the results of attribute reduction, which can no...
متن کاملFeature ranking in rough sets
We propose a novel feature ranking technique using discernibility matrix. Discernibility matrix is used in rough set theory for reduct computation. By making use of attribute frequency information in discernibility matrix, we develop a fast feature ranking mechanism. Based on the mechanism, two heuristic reduct computation algorithms are proposed. One is for optimal reduct and the other for app...
متن کامل